Parameterized and exact computation (Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006)Bodlaender, Hans L; Langston, Michael A.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-39098-7, 1Vol, XI-277 p, isbn 3-540-39098-7Conference Proceedings

On parameterized approximabilityYIJIA CHEN; GROHE, Martin; GRÜBER, Magdalena et al.Lecture notes in computer science. 2006, pp 109-120, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Fixed-parameter complexity of minimum profile problemsGUTIN, Gregory; SZEIDER, Stefan; YEO, Anders et al.Lecture notes in computer science. 2006, pp 60-71, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Parameterized complexity of independence and domination on geometric graphsMARX, Daniel.Lecture notes in computer science. 2006, pp 154-165, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Parameterized approximation problemsDOWNEY, Rodney G; FELLOWS, Michael R; MCCARTIN, Catherine et al.Lecture notes in computer science. 2006, pp 121-129, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 9 p.Conference Paper

Kernels : Annotated, proper and inducedABU-KHZAM, Faisal N; FERNAU, Henning.Lecture notes in computer science. 2006, pp 264-275, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Applying modular decomposition to parameterized bicluster editingPROTTI, Fabio; DANTAS DA SILVA, Maise; SZWARCFITER, Jayme Luiz et al.Lecture notes in computer science. 2006, pp 1-12, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

The parameterized complexity of enumerating frequent itemsetsHAMILTON, Matthew; CHAYTOR, Rhonda; WAREHAM, Todd et al.Lecture notes in computer science. 2006, pp 227-238, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

On the effective enumerability of NP problemsJIANER CHEN; KANJ, Iyad A; JIE MENG et al.Lecture notes in computer science. 2006, pp 215-226, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Randomized approximations of parameterized counting problemsMÜLLER, Moritz.Lecture notes in computer science. 2006, pp 50-59, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 10 p.Conference Paper

The cluster editing problem : Implementations and experimentsDEHNE, Frank; LANGSTON, Michael A; XUEMEI LUO et al.Lecture notes in computer science. 2006, pp 13-24, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

The parameterized complexity of maximality and minimality problemsYIJIA CHEN; FLUM, Jörg.Lecture notes in computer science. 2006, pp 25-37, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

An exact algorithm for the minimum dominating clique problemKRATSCH, Dieter; LIEDLOFF, Mathieu.Lecture notes in computer science. 2006, pp 130-141, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

The lost continent of polynomial time : Preprocessing and kernelizationFELLOWS, Michael R.Lecture notes in computer science. 2006, pp 276-277, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 2 p.Conference Paper

Finding a minimum feedback vertex set in time o(1.7548ⁿ)FOMIN, Fedor V; GASPERS, Serge; PYATKIN, Artem V et al.Lecture notes in computer science. 2006, pp 184-191, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 8 p.Conference Paper

Parameterizing MAX SNP problems above guaranteed valuesMAHAJAN, Meena; RAMAN, Venkatesh; SIKDAR, Somnath et al.Lecture notes in computer science. 2006, pp 38-49, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Random separation : A new method for solving fixed-cardinality optimization problemsLEIZHEN CAI; SIU MAN CHAN; SIU ON CHAN et al.Lecture notes in computer science. 2006, pp 239-250, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

The undirected feedback vertex set problem has a poly(κ) kernelBURRAGE, Kevin; ESTIVILL-CASTRO, Vladimir; FELLOWS, Michael et al.Lecture notes in computer science. 2006, pp 192-202, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 11 p.Conference Paper

Edge dominating set : Efficient enumeration-based exact algorithmsFERNAU, Henning.Lecture notes in computer science. 2006, pp 142-153, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Fixed-parameter approximation : Conceptual framework and approximability resultsLIMING CAI; XIUZHEN HUANG.Lecture notes in computer science. 2006, pp 96-108, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

Greedy localization and color-coding : Improved matching and packing algorithmsYANG LIU; SONGJIAN LU; CHEN, Jianer et al.Lecture notes in computer science. 2006, pp 84-95, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Towards a taxonomy of techniques for designing parameterized algorithmsSLOPER, Christian; TELLE, Jan Arne.Lecture notes in computer science. 2006, pp 251-263, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

Fixed parameter tractability of independent set in segment intersection graphsKARA, Jan; KRATOCHVIL, Jan.Lecture notes in computer science. 2006, pp 166-174, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 9 p.Conference Paper

Fixed-parameter tractability results for full-degree spanning tree and its dualJIONG GUO; NIEDERMEIER, Rolf; WERNICKE, Sebastian et al.Lecture notes in computer science. 2006, pp 203-214, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

On the OBDD size for graphs of bounded tree-and clique-widthMEER, Klaus; RAUTENBACH, Dieter.Lecture notes in computer science. 2006, pp 72-83, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper